Pii: S0925-7721(99)00025-5
نویسندگان
چکیده
To use 3D models on the Internet or in other bandwidth-limited applications, it is often necessary to compress their triangle mesh representations. We consider the problem of balancing two forms of lossy mesh compression: reduction of the number of vertices by simplification, and reduction of the number of bits per vertex coordinate. LetA(V,B) be a triangle mesh approximation for an original modelO . Suppose thatA(V,B) has V vertices, each represented using B bits per coordinate. Given a limit F on the file size for A(V,B), what are the optimal values of B and V that minimize the approximation error? Given a desired error boundE, what are optimal B and V , and how many total bits are needed? We develop answers to these questions by using a shape complexity measure K , which, for any given object approximates the product EV . We give formulae linking B, V, F, E and K , and we explore a simple algorithm for estimating K and the optimal B and V for piecewise spherical approximations of arbitrary triangle meshes. 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
A Helly-type theorem for higher-dimensional transversals
We generalize the Hadwiger(-Danzer-Grünbaum-Klee) theorem on line transversals for an unbounded family of compact convex sets to the case of transversal planes of arbitrary dimension. This is the first Helly-type theorem known for transversals of dimension between 1 and d− 1.
متن کاملPii: S0925-7721(99)00016-4
Define a graph GT (n) with one node for each triangulation of a convex n-gon. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of triangles forming the same quadrilateral. In this paper we introduce a tree of all triangulations of polygons with any number of vertices which gives a unified framework in w...
متن کاملA hierarchical method for real-time distance computation among moving convex bodies
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical representations. For convex polygons, we prove that H-Walk improves on the classic Lin-Canny and Dobkin-Kirkpatrick algorithms. We have implemented H-Walk for moving convex polyhedra in three dimensions. Experimental r...
متن کاملPii: S0925-7721(99)00011-5
An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters. The predicate is first evaluated using rounding computations, and an error estimation gives a certificate of the validity of the result. In this note, we study the statistical efficiency of filt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999